Anticipation Optimization in Dynamic Job Shops
نویسنده
چکیده
The flexibility present in a job shop is an important determinant of the future success of the shop, since it increases the ability to deal with the changes a job shop is faced with in a dynamic environment. The presence of idle-time in a job shop schedule contributes considerably to this flexibility. By introducing an anticipation factor that preserves idletime in the scheduling process more flexible schedules will be preferred. Here, research on the optimization of this anticipation factor, given a certain dynamic job shop environment, is presented. Our findings indicate that performance results are not very sensitive to small changes in the particulars of the anticipation factor. 1 DYNAMIC OPTIMIZATION
منابع مشابه
Introduction to Scheduling: Terminology, Classification
General Optimization Methods Mathematical Programming, Constraint Programming, Heuristics Problem Specific Algorithms (Dynamic Programming, Branch and Bound) Scheduling Single and Parallel Machine Models Flow Shops and Flexible Flow Shops Job Shops Resource-Constrained Project Scheduling Timetabling Interval Scheduling, Reservations Educational Timetabling Workforce and Employee Timetabling Tra...
متن کاملAn Ant Colony Optimization algorithm for Flexible Job shop scheduling problem
Scheduling involves the allocation of resources over a period of time to perform a collection of tasks (Baker, 1974). It is a decision-making process that plays an important role in most manufacturing and service industries (Pinedo, 2005). Scheduling in the context of manufacturing systems refers to the determination of the sequence in which jobs are to be processed over the production stages, ...
متن کاملMulti-objective Optimisation Methods for Min- imising Total Weighted Tardiness, Electricity Consumption and Electricity Cost in Job Shops Through Scheduling
متن کامل
New Routing Rules for Dynamic Flexible Job Shop Scheduling with Sequence-Dependent Setup Times
Flexible job shops are characterized by the existence of alternative –not necessarily identicalmachines, which permits parts to have different alternative routes in the shop. In a dynamic scheduling situation in which jobs continuously arrive over time, part routing rules are needed to deal with such routing flexibility as much as sequencing rules which define the order by which parts are admit...
متن کاملApplying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved. However, such a procedure has been reported to be highly ineffective for the Flow Shop problems (Jain and Meeran 2002). In particular, we show th...
متن کامل